Termination w.r.t. Q proof of TRS/Waldmannjwno6.trs

Termination w.r.t. Q of the following Term Rewriting System could not be shown:

Q restricted rewrite system:
The TRS R consists of the following rules:

f(x, h(y)) → h(f(f(h(a), y), x))

Q is empty.

↳ QTRS

  ↳ Overlay + Local Confluence

Q restricted rewrite system:
The TRS R consists of the following rules:

f(x, h(y)) → h(f(f(h(a), y), x))

Q is empty.

The TRS is overlay and locally confluent. By [15] we can switch to innermost.

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

f(x, h(y)) → h(f(f(h(a), y), x))

The set Q consists of the following terms:

f(x0, h(x1))

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

F(x, h(y)) → F(h(a), y)
F(x, h(y)) → F(f(h(a), y), x)

The TRS R consists of the following rules:

f(x, h(y)) → h(f(f(h(a), y), x))

The set Q consists of the following terms:

f(x0, h(x1))

We have to consider all minimal (P,Q,R)-chains.

↳ QTRS

  ↳ Overlay + Local Confluence

    ↳ QTRS

      ↳ DependencyPairsProof

        ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

F(x, h(y)) → F(h(a), y)
F(x, h(y)) → F(f(h(a), y), x)

The TRS R consists of the following rules:

f(x, h(y)) → h(f(f(h(a), y), x))

The set Q consists of the following terms:

f(x0, h(x1))

We have to consider all minimal (P,Q,R)-chains.